On A Combinatorial Problem Connected withFactorizations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Combinatorial Problem

Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...

متن کامل

Combinatorial Optimization on k-Connected Graphs

The topic of network design occupies a central place in Combinatorial Optimization. There are a number of key open questions pertaining to k-node connected graphs on topics such as minimum-cost k-connected spanning subgraphs, connectivity augmentation, and orientations. These questions/conjectures are analogous to similar statements for edge connectivity. Most of the statements for edge connect...

متن کامل

On a Combinatorial Problem in Latin Squares

1. Denote by S, an arbitrary latin square with n elements {a 1 , a 2 , . . . , a„ } . A row and column of this square, intersecting on the main diagonal (i .e . diagonal beginning at the left lower corner) will be called corresponding . After striking out n c arbitrary rows and corresponding columns, a square T, with c x c entries remains . Such a square will be called a principal minor. It is ...

متن کامل

On a Combinatorial Problem of Asmus Schmidt

For any integer r > 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n

متن کامل

On a Combinatorial Problem in Number Theory

1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one can always select a subsequence of g{N) integers with the property that no sum of two distinct integers of this subsequence belongs to the original sequence. It should be mentioned that the function ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1997

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-72-2-251-268